Automated Reasoning and Exhaustive Search: Quasigroup Existence Problems
نویسندگان
چکیده
منابع مشابه
Solving Open Quasigroup Problems by Propositional Reasoning
There are many open problems in the study of quasigroups. Recently, automated techniques have been employed to attack these open problems. In this paper, we show how a propositional satissability prover is used to solve many open problems in quasigroups. Our success relies on a powerful propositional prover called SATO and a useful technique called the cyclic group construction. We provide deta...
متن کاملClassification Results in Quasigroup and Loop Theory via a Combination of Automated Reasoning Tools
We present some novel partial classification results in quasigroup and loop theory. For quasigroups up to size XXX and loops up to size YYY, we describe a unique property which determines the isomorphism (and in the case of loops, the isotopism) class for any example. These invariant properties were generated using a variety of automated techniques – including machine learning and computer alge...
متن کاملResearch in Automated Reasoning
A large part of Artificial Intelligence (AI) is based on the idea that the best way for a computer to produce intelligent behavior in many application domains is by explicitly encoding knowledge about the domain in some “knowledge base” KB, and then using reasoning algorithms to extract consequences from that knowledge. Knowledge representation deals with the issue of defining languages suitabl...
متن کاملUsing a Theorem Prover for Reasoning on Constraint Problems
Specifications of constraint problems can be considered logical formulae. As a consequence, it is possible to infer their properties by means of automated reasoning tools, with the goal of automatically synthesizing transformations that can make the solving process more efficient. The purpose of this paper is to link two important technologies: automated theorem proving and constraint programmi...
متن کاملAn Empirical Study of Multi-Point Constructive Search for Constraint Satisfaction
Multi-Point Constructive Search (MPCS) is a constructive search technique which borrows the idea from local search of being guided by multiple viewpoints. MPCS consists of a series of resource-limited backtracking searches: each starting from an empty solution or guided by one of a set of high quality, “elite” solutions encountered earlier in the search. This paper focuses on MPCS as applied to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995